Nilpotent matrices with invertible transpose

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invertible and Nilpotent Matrices over Antirings

Abstract. In this paper we characterize invertible matrices over an arbitrary commutative antiring S with 1 and find the structure of GLn(S). We find the number of nilpotent matrices over an entire commutative finite antiring. We prove that every nilpotent n×n matrix over an entire antiring can be written as a sum of ⌈log2 n⌉ square-zero matrices and also find the necessary number of square-zer...

متن کامل

Partial Transpose of Permutation Matrices

The main purpose of this paper is to look at the notion of partial transpose from the combinatorial side. In this perspective, we solve some basic enumeration problems involving partial transpose of permutation matrices. Specifically, we count the number of permutations matrices which are invariant under partial transpose. We count the number of permutation matrices which are still permutation ...

متن کامل

Sums of Alternating Matrices and Invertible Matrices

A square matrix is said to be alternating-clean if it is the sum of an alternating matrix and an invertible matrix. In this paper, we determine all alternating-clean matrices over any division ring K. If K is not commutative, all matrices are alternating-clean, with the exception of the 1× 1 zero matrix. If K is commutative, all matrices are alternating-clean, with the exception of odd-size alt...

متن کامل

Counting Symmetric Nilpotent Matrices

We determine the number of nilpotent matrices of order n over Fq that are selfadjoint for a given nondegenerate symmetric bilinear form, and in particular find the number of symmetric nilpotent matrices.

متن کامل

Fountain Codes and Invertible Matrices

This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1970

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1970-0252408-6